An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
نویسنده
چکیده
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We refine the technique to strengthen the result, constructing an oracle relative to which a conjecture of Lipton is false.
منابع مشابه
Some Results on Relativized Deterministic and Nondeterministic Time Hierarchies
Relativized forms of deterministic and nondeterministic time complexity classes are considered. It is shown, at variance with recently published observations, that one basic step by step simulation technique in complexity theory does not relativize (i.e., does not generalize to computations with oracles), using the current definitions for time and space complexity of oracle computations. A new ...
متن کاملOn Randomized versus Deterministic Computation ? Zpp a = Exptime a = Exptime (= Dtime(2 Poly )). Furthermore, for All the Sets M : M Ur a () M 2 Exptime
In contrast to deterministic or nondeterministic computation, it is a fundamental open problem in randomized computation how to separate diierent ran-domized time classes (at this point we do not even know how to separate linear randomized time from O(n log n) randomized time) or how to compare them relative to corresponding deterministic time classes. In other words we are far from understandi...
متن کاملRandomness is Hard
We study the set of incompressible strings for various resource bounded versions of Kolmogorov complexity. The resource bounded versions of Kolmogorov complexity we study are: polynomial time CD complexity deened by Sipser, the nondeterministic variant due to Buhrman and Fortnow, and the polynomial space bounded Kolmogorov complexity, CS introduced by Hartmanis. For all of these measures we dee...
متن کاملDerandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov complexity measures (KNt and KNT) and examine the properties of these measures using constructions of hitting set generators for nondeterministic circuits [22, 26]. We observe that KNt bears many similarities to the nondeter...
متن کاملResource bounded symmetry of information revisited
The information contained in a string x about a string y is the difference between the Kolmogorov complexity of y and the conditional Kolmogorov complexity of y given x, i.e., I(x : y) = C(y) − C(y |x). The Kolmogorov–Levin Theorem says that I(x : y) is symmetric up to a small additive term. We investigate if this property also holds for several versions of polynomial time bounded Kolmogorov co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1004.3993 شماره
صفحات -
تاریخ انتشار 2010